The Brouwer Fixed Point Theorem for Intervals 1 Toshihiko Watanabe Shinshu

نویسنده

  • Toshihiko Watanabe
چکیده

The following three propositions are true: (1) For all real numbers a, b, c, d such that a ≤ c and d ≤ b and c ≤ d holds [c, d] ⊆ [a, b]. (2) For all real numbers a, b, c, d such that a ≤ c and b ≤ d and c ≤ b holds [a, b] ∪ [c, d] = [a, d]. (3) For all real numbers a, b, c, d such that a ≤ c and b ≤ d and c ≤ b holds [a, b] ∩ [c, d] = [c, b]. In the sequel a, b, c, d are real numbers. We now state four propositions: (4) For every subset A of 1 such that A = [a, b] holds A is closed. (5) If a ≤ b, then [a, b]T is a closed subspace of 1 . (6) If a ≤ c and d ≤ b and c ≤ d, then [c, d]T is a closed subspace of [a, b]T. This paper was done under the supervision of Z. Karno while the author was visiting the Institute of Mathematics of Warsaw University in Bia lystok.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Proof of the Jordan Curve Theorem via the Brouwer Fixed Point Theorem

The aim of the paper is to report on MIZAR codification of the Jordan curve theorem, a theorem chosen as a challenge to be completely verified using formal methods at the time when they started being commonly used. Formalization was done based on proofs taken from the literature, where theorems mentioned in the title of the paper from ”Brouwer’s Fixed Point Theorem and the Jordan Curve Theorem”...

متن کامل

The Brouwer Fixed Point Theorem for Intervals1

(1) If a≤ c and d ≤ b, then [c,d]⊆ [a,b]. (2) If a≤ c and b≤ d and c≤ b, then [a,b]∪ [c,d] = [a,d]. (3) If a≤ c and b≤ d and c≤ b, then [a,b]∩ [c,d] = [c,b]. (4) For every subset A of R1 such that A = [a,b] holds A is closed. (5) If a≤ b, then [a, b]T is a closed subspace of R1. (6) If a≤ c and d ≤ b and c≤ d, then [c, d]T is a closed subspace of [a, b]T. (7) If a≤ c and b≤ d and c≤ b, then [a,...

متن کامل

The Hex Game Theorem and the Arrow Impossibility Theorem: the Case of Weak Orders

The Arrow impossibility theorem when individual preferences are weak orders is equivalent to the HEX game theorem. Because Gale showed that the Brouwer fixed point theorem is equivalent to the HEX game theorem, this paper indirectly shows the equivalence of the Brouwer fixed point theorem and the Arrow impossibility theorem. Chichilnisky showed the equivalence of her impossibility theorem and t...

متن کامل

A Combinatorial Approach to the Brouwer Fixed Point Theorem

The Brouwer Fixed Point Theorem states that any continuous mapping from a closed ball in Euclidean space to itself has at least one fixed point. This theorem has a wide variety of applications in areas such as differential equations, economics, and game theory. Although this is fundamentally an analytic and topological statement, there exists an elegant combinatorial proof using Sperner’s Lemma...

متن کامل

Spherical Designs via Brouwer Fixed Point Theorem

For each N ≥ cdn 2d(d+1) d+2 we prove the existence of a spherical ndesign on Sd consisting of N points, where cd is a constant depending only on d.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007